Invex optimisation problems

Mixed quasi invex equilibrium problems

We introduce a new class of equilibrium problems, known as mixed quasi invex equilibrium (or equilibrium-like) problems. This class of invex equilibrium problems includes equilibrium problems, variational inequalities, and variational-like inequalities as special cases. Several iterative schemes for solving invex equilibrium problems are suggested and analyzed using the auxiliary principle tech...

On interval-valued optimization problems with generalized invex functions

*Correspondence: [email protected] 1Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia 2Permanent address: Department of Mathematics, Aligarh Muslim University, Aligarh, 202 002, India Full list of author information is available at the end of the article Abstract This paper is devoted to study interval-valued optimization p...

Norm–Based Approximation in Invex Multi- Objective Programming Problems

This paper addresses the problem of capturing nondominated points on convex Pareto frontiers, which are encountered in invex multi-objective programming problems. An algorithm to find a piecewise linear approximation of the nondominated set of convex Pareto frontier are applied. Index Term-Approximation, Nondominated points, Invex multi-objective problems, Block norms.

Applying Extremal Optimisation To Dynamic Optimisation Problems

Uncertain Constraint Optimisation Problems

Data uncertainties are inherent in the real world. The uncertain CSP (UCSP) is an extension of classical CSP that models incomplete and erroneous data by coefficients in the constraints whose values are unknown but bounded, for instance by an interval. It resolution is a closure, a set of potential solutions. This paper extends the UCSP model to account for optimisation criteria, by defining th...